Algebraic methods toward higher-order probability inequalities, II
نویسندگان
چکیده
منابع مشابه
Algebraic Methods toward Higher - Order Probability Inequalities , Ii
Let (L,4) be a finite distributive lattice, and suppose that the functions f1, f2 :L→ R are monotone increasing with respect to the partial order 4. Given μ a probability measure on L, denote by E(fi) the average of fi over L with respect to μ, i = 1,2. Then the FKG inequality provides a condition on the measure μ under which the covariance, Cov(f1, f2) := E(f1f2)−E(f1)E(f2), is nonnegative. In...
متن کاملAlgebraic Methods toward Higher-order Probability Inequalities, Ii by Donald St. P. Richards
Let (L, ) be a finite distributive lattice, and suppose that the functions f1, f2 :L→ R are monotone increasing with respect to the partial order . Given μ a probability measure on L, denote by E(fi) the average of fi over L with respect to μ, i = 1,2. Then the FKG inequality provides a condition on the measure μ under which the covariance, Cov(f1, f2) := E(f1f2) − E(f1)E(f2), is nonnegative. I...
متن کاملHigher Order Turán Inequalities
The celebrated Turán inequalities P 2 n(x) − Pn−1(x)Pn+1(x) ≥ 0, x ∈ [−1, 1], n ≥ 1, where Pn(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ2 n − γn−1γn+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the L...
متن کاملHigher order Hardy inequalities
This note deals with the inequality (∫ b a |u(x)|w0(x)dx )1/q ≤ C (∫ b a |u(x)|wk(x)dx )1/p , (1) more precisely, with conditions on the parameters p > 1, q > 0 and on the weight functions w0, wk (measurable and positive almost everywhere) which ensure that (1) holds for all functions u from a certain class K with a constant C > 0 independent of u. Here −∞ ≤ a < b ≤ ∞ and k ∈ N and we will cons...
متن کاملAlgebraic Higher-Order Matching
The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2004
ISSN: 0091-1798
DOI: 10.1214/009117904000000298